Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((YIN Guisheng[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Online incentive mechanism based on reputation for mobile crowdsourcing system
WANG Yingjie, CAI Zhipeng, TONG Xiangrong, PAN Qingxian, GAO Yang, YIN Guisheng
Journal of Computer Applications 2016, 36 (
8
): 2121-2127. DOI:
10.11772/j.issn.1001-9081.2016.08.2121
Abstract
(
1063
)
PDF
(1144KB)(
702
)
Knowledge map
Save
In big data environment, the research on mobile crowdsourcing system has become a research hotspot in Mobile Social Network (MSN). However, the selfishness of individuals in networks may cause the distrust problem of mobile crowdsourcing system. In order to inspire individuals to select trustful strategy, an online incentive mechanism based on reputation for mobile crowdsourcing system named RMI was proposed. Combining evolutionary game theory and Wright-Fisher model in biology, the evolution trend of mobile crowdsourcing system was studied. To solve free-riding and false-reporting problems, the reputation updating methods were established. Based on the above researches, an online incentive mechanism was built, which can inspire workers and requesters to select trustful strategies. The simulation results verify the effectiveness and adaptability of the proposed incentive mechanism. Compared with the traditional social norm-based reputation updating method, RMI can improve the trust degree of mobile crowdsourcing system effectively.
Reference
|
Related Articles
|
Metrics
Select
Super pixel segmentation algorithm based on Hadoop
WANG Chunbo, DONG Hongbin, YIN Guisheng, LIU Wenjie
Journal of Computer Applications 2016, 36 (
11
): 2985-2992. DOI:
10.11772/j.issn.1001-9081.2016.11.2985
Abstract
(
710
)
PDF
(1313KB)(
529
)
Knowledge map
Save
In view of the high time complexity of pixel segmentation, a super pixel segmentation algorithm was proposed for high resolution image. Super pixels instead of the original pixels were used as the segmentation processing elements and the characteristics of Hadoop and the super pixels were combined. Firstly, a static and dynamic adaptive algorithm for multiple tasks was proposed which could reduce the coupling of the blocks in HDFS (Hadoop Distributed File System) and task arranging. Secondly, based on the constraint in the distance and gradient on the super pixel formed by the boundary of super pixel block, a parallel watershed segmentation algorithm was proposed in each Map node task. Meanwhile, two merging strategies were proposed and compared in the super pixel block merging in the Shuffle process. Finally, the combination of super pixels was optimized to complete the final segmentation in the Reduce node task. The experimental results show that the proposed algorithm is superior to the Simple Linear Iterative Cluster (SLIC) algorithm and Normalized cut (Ncut) algorithm in Boundary Recall ratio (BR) and Under segmentation Error (UE), and the segmentation time of the high-resolution image is remarkably decreased.
Reference
|
Related Articles
|
Metrics
Select
Multi-feature fusion method for mesh simplification
WANG Hailing WANG Jian YIN Guisheng FU Qiao ZHOU Bo
Journal of Computer Applications 2013, 33 (
11
): 3167-3171.
Abstract
(
534
)
PDF
(780KB)(
392
)
Knowledge map
Save
Most mesh simplification algorithms for three-dimensional (3D) may cause oversimplification and distortion in the processing of simplification. To address this problem, an efficient multi-feature fusion method for mesh simplification was proposed. The proposed method measured geometric feature information based on quadric error metric weighted by normal information firstly, then used torsion weighted by side ratio of triangle to measure visual feature information, at last proposed a multi-feature fusion metric to guide model simplification. The experimental results have been compared on execution time and visual quality with other edge contraction algorithms; the results show that the proposed method can guarantee computational efficiency, improve visual shape feature, and reduce oversimplification and distortion for simplified model.
Related Articles
|
Metrics